Simulation of Fading Channel and Burst Error Behavior of State-3 Memoryless Markov Model

نویسندگان

  • Tijjani Adam
  • U. Hashim
چکیده

The paper contain a report on simulation of fading channel using Markov Model through a very simple and effective approach, The study established the successful application of Discrete time Simulation in fading channel by applying a tri-states memory-less Markov Model. We generated Four Matlab programs to simulate the Markov Fading Channel and successfully implemented the generated code through the model. Thus, this validates the applicability of the Markov Model in the simulation of fading channel. The probability of error varies according to any change that could happen in the probability of moving from one state to another. Considering 20 points around the standard probability of transition, each point is the average of 100 cycles of the same probability of transition, For Burst Error Behavior of State-3, Simulations have been performed with the data streams consisting of 4.8 Megabits have been directed through the Markov Channel in different test conditions. The length of each error as well as its frequency of occurrence has been recorded. To better conform to industrial application where long data stream would be cut into data-packets of fixed length before transmission, the 4.8 Megabits data stream has been cut into various data-packets sizes of 300 bits, 1200 bits, 4800 bits and 19200 bits for comparison purpose. These particular packet sizes have been chosen in consideration of the use of RC-Interleave in subsequent simulations and for Error-CorrectionCoding and Interleaved Coding Scheme. We also studied the burst error behavior of State-3 memory-less Markov Model and presented the use of Error-CorrectionCoding with Interleaved scheme which is justified by the illustration of consistently lower Bir-Error-Rate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Sure Convergence of Relative Frequency of Occurrence of Burst Errors on Channels with Memory∗

Motivated by intention to evaluate asymptotically multiple-burst-error-correcting codes on channels with memory, we will derive the following fact. Let {Zi} be a hidden Markov process, i.e., a functional of a Markov chain with a finite state space, and Wb(Z1Z2 . . . Zn) denote the number of burst errors that appear in Z1Z2 . . . Zn, where the number of burst errors is counted using Gabidulin’s ...

متن کامل

Turbo Codes for Fading and Burst Channels

Joseph H. Kang, Wayne E. Stark, and Alfred O. Hero Dept. of Electrical Engineering and Computer Science University of Michigan, Ann Arbor Abstract In this paper, turbo codes are investigated in fading and burst channels. In particular, we consider the design and performance of turbo codes for a GilbertElliot burst channel and in a realistic fading channel. For both cases, our approach is to com...

متن کامل

Genetic algorithm based Finite State Markov Channel modeling

Statistical properties of the error sequences produced by fading channels with memory have a strong influence over the performance of high layer protocols and error control codes. Finite State Markov Channel (FSMC) models can represent the temporal correlations of these sequences efficiently and accurately. This paper proposes a simple genetic algorithm (GA) based search for the optimum state t...

متن کامل

Microsoft Word - Burst-and-Random-Error-Code-Evaluation

Markov chains are a popular means to capture correlated random processes for characterization and analysis of error pattern or bursty traffic in data transmission. The performance evaluation of communication protocols based on Markov models is tractable with limited state space and often depends on efficient implementation. Simulation or other methods have to be adopted for system of higher com...

متن کامل

Capacity, mutual information, and coding for finite-state Markov channels

The Finite-State Markov Channel (FSMC) is a discrete time-varying channel whose variation is determined by a finite-state Markov process. These channels have memory due to the Markov channel variation. We obtain the FSMC capacity as a function of the conditional channel state probability. We also show that for i.i.d. channel inputs, this conditional probability converges weakly, and the channel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011